minimum spanning trees造句
例句与造句
- Minimum spanning tree algorithm based on extended double list storage structure
基于扩展双链式存储结构的最小生成树算法 - Minimum spanning tree
最小代价生成树 - An algorithm for finding minimum spanning trees and comparison with other algorithm
求最小生成树的另一算法及其与其它算法的比较 - Minimum spanning tree
最小生成树 - The application and analyze about the algorithm of minimum spanning tree in multi - join
最小生成树算法在多元连接中的应用及算法分析 - It's difficult to find minimum spanning trees in a sentence. 用minimum spanning trees造句挺难的
- On the models of graph theory based on minimum spanning tree with applications in medicine
基于最小生成树的图论模型及其在医学中的应用 - A new algorithm based on the minimum spanning tree theory of graph was proposed which improved the computation efficiency and reliability of previous methods . 2
对基于图的最小生成树理论的算法进行了改进，新算法在效率和可靠性方面都有所提高； 2 - The algorithm starts with generating a minimum spanning tree to find basic route , and then select , an adjustable unit to modify and determine the final routes
该算法从构造最小生成树开始，找出基本线路；然后通过选择可调单元调整线路得到优化的线路。 - At first , various existing dynamic multicast routing algorithms with no constraint is compared . a dynamic multicast algorithm dpg ( dynamic prim - based greedy multicast algorithm ) which is based on minimum span tree is presented
在比较了典型的动态无约束费用优化多播路由算法后，提出了基于最小生成树的动态贪婪算法? ?一dpg算法。 - For solving the problem of finding the degree - constrained minimum spanning tree ( dcmst ) in network design and optimization , a heuristic search method is proposed , in which based on minimum spanning tree , degrees of vertices over the constrained degrees are reduced to the required state
摘要针对网络设计和优化中度约束最小生成树问题，提出了一种基于贪心思想的启发式算法求解度约束最小生成树。 - Firstly , the connected end sets of the relay lines are got using the breadth first search algorithm and the connected relationship of wiring terms is got in the electrical circuit diagram according to different cad block structure of different element type . secondly , the appropriate specification of the relay element is chosen by using the equinoctial graph algorithm , and the panel layout diagram is generated automatically by the combining automatic layout and manual intervention . finally , the optimized path algorithm which passes each vertex in the completed non - directional graph once and only once is put forward , this algorithm and the prim minimum spanning tree algrotithm can generate the inner panel wiring diagram and terminal wiring diagram automatically
首先,采用广度优先搜索算法查找电气原理图中的连通导线端点集,并根据不同类型的继电元件对应的cad图块结构的不同,得到电气原理图中元件接线端子之间的连接关系;其次,根据二分图匹配算法为电气原理图中继电元件选择合适的型号和规格,并采用人工干预和自动布置相结合的方法完成屏面布置图的自动生成;最后,提出了完全无向图中经过每个顶点一次且仅一次的优化路径算法,利用该算法和经过预处理的prim最小生成树算法自动生成屏内安装接线图和端子接线图。 - Different from other researches , autoore uses the proposed java semantic model as input data , and gives a tree - liked , hierarchical structured and semantic cluster set . the clustering method is based on a minimum spanning tree that represents the software system . the clustering objective function is designed according to the software modularization metric and cognition psychology theory
抽象是autoore的核心，它首次采用对象系统的语义关系抽取数据为输入，利用基于mst表示的、聚集目标结合了程序认知心理学理论的软件聚集方法，得到一个具有丰富语义的、组织为树状的、分层的聚集集合。 - Concretely we discuss the application of the shortest path problem , traveling salesman problerm and project management method on the touring itinerary improvement of travel agency . furthermore , we explore the use of minimum spanning tree problem , overlaid problerm and maximum flow problerm on the touring itinerary improvement of scenic spots . and also enclosed detailed spreadsheet solutions
具体的，讨论了最短路问题、旅行商问题和排程问题在旅行社线路优化中的应用；讨论了最小支撑树问题、覆盖问题和最大流问题在旅游景区线路优化中的运用，并在附录中给出了详细的电子表格解法。 - Topics covered include : randomized computation ; data structures ( hash tables , skip lists ) ; graph algorithms ( minimum spanning trees , shortest paths , minimum cuts ) ; geometric algorithms ( convex hulls , linear programming in fixed or arbitrary dimension ) ; approximate counting ; parallel algorithms ; online algorithms ; derandomization techniques ; and tools for probabilistic analysis of algorithms
主题包括?随机计算、资料结构（杂凑表、省略串列） 、图论演算法（最小扩张树，最短路径，最少切割） 、几何演算法（凸壳、在固定或任意维度的线性规划) 、近似计数、平行演算法、线上演算法、消去随机技术，以及演算法的机率分析工具。 - This is improved in the nmst algorithm . the steps of constructing nmst are : firstly , construct the derived image which is generated according original image ; secondly , construct minimum spanning tree of derived image ; at last , construct spanning tree of original image by adding edges to the minimum spanning tree of derived image
针对最小生成树算法计算量大的缺点，构造近最小生成树算法，近最小生成树算法通过生成抽样图的最小生成树，通过图的扩展得到原始图像的近最小生成树，将其作为预测树对超光谱图像进行去相关处理。